The Inverse Knapsack Problem par
نویسندگان
چکیده
منابع مشابه
A Knapsack Cryptosystem Based on The Discrete Logarithm Problem
This paper introduces a knapsack cryptosystem based on the problem of discrete logarithm. The proposed algorithm obtains the public knapsack values by finding the discrete logarithms of the secret knapsack ones. Also, it encrypts the message block by obtaining its binary bits and then computing the modular multiplication of the public knapsack values corresponding to the 1-bits of the binary fo...
متن کاملInverse Fractional Knapsack Problem with Profits and Costs Modification
We address in this paper the problem of modifying both profits and costs of a fractional knapsack problem optimally such that a prespectified solution becomes an optimal solution with prespect to new parameters. This problem is called the inverse fractional knapsack problem. Concerning the l1-norm, we first prove that the problem is NP -hard. The problem can be however solved in quadratic time ...
متن کاملAn Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem
A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...
متن کاملAPPROXIMATE ALGORITHM FOR THE MULTI-DIMENSIONAL KNAPSACK PROBLEM BY USING MULTIPLE CRITERIA DECISION MAKING
In this paper, an interesting and easy method to solve the multi-dimensional knapsack problem is presented. Although it belongs to the combinatorial optimization, but the proposed method belongs to the decision making field in mathematics. In order to, initially efficiency values for every item is calculated then items are ranked by using Multiple Criteria Decision Making (MCDA). Finally, ite...
متن کاملAn employee transporting problem
An employee transporting problem is described and a set partitioning model is developed. An investigation of the model leads to a knapsack problem as a surrogate problem. Finding a partition corresponding to the knapsack problem provides a solution to the problem. An exact algorithm is proposed to obtain a partition (subset-vehicle combination) corresponding to the knapsack solution. It require...
متن کامل